﻿#region Copyright (c) 2003 - 2008, Andreas Mueller
/////////////////////////////////////////////////////////////////////////////////////////
// 
// Copyright (c) 2003 - 2008, Andreas Mueller.
// All rights reserved. This program and the accompanying materials
// are made available under the terms of the Eclipse Public License v1.0
// which accompanies this distribution, and is available at
// http://www.eclipse.org/legal/epl-v10.html
//
// Contributors:
//    Andreas Mueller - initial API and implementation
//
// 
// This software is derived from software bearing the following
// restrictions:
// 
// Copyright (c) 1994
// Hewlett-Packard Company
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Hewlett-Packard Company makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// Copyright (c) 1996,1997
// Silicon Graphics Computer Systems, Inc.
// 
// Permission to use, copy, modify, distribute and sell this software
// and its documentation for any purpose is hereby granted without fee,
// provided that the above copyright notice appear in all copies and
// that both that copyright notice and this permission notice appear
// in supporting documentation.  Silicon Graphics makes no
// representations about the suitability of this software for any
// purpose.  It is provided "as is" without express or implied warranty.
// 
// 
// (C) Copyright Nicolai M. Josuttis 1999.
// Permission to copy, use, modify, sell and distribute this software
// is granted provided this copyright notice appears in all copies.
// This software is provided "as is" without express or implied
// warranty, and with no claim as to its suitability for any purpose.
// 
/////////////////////////////////////////////////////////////////////////////////////////
#endregion

using NUnit.Framework;
using NStl.Collections;
using NUnit.Framework.SyntaxHelpers;
using System;
using System.Collections;
using NStl.NUnit.Support.Functors;
using NStl.SyntaxHelper;

namespace NStl.NUnit.ContainerFixture.UniqueSet
{
    [TestFixture]
    public class UniqueSetFixture
    {
        private UniqueSet<string> uniqueSet;
        [SetUp]
        public void SetUp()
        {
            uniqueSet = new UniqueSet<string>(new StringLessAllowsNull());
            for (int i = 0; i < 6; ++i)
                uniqueSet.Insert(i.ToString());
        }
        [Test]
        public void Count()
        {
            Assert.That(uniqueSet, Has.Count(6));
        }
        [Test]
        public void Find()
        {
            Assert.That(uniqueSet.Find("5").Value, Is.EqualTo("5"));
        }
        [Test]
        public void FindFails()
        {
            Assert.That(uniqueSet.Find("42"), Is.EqualTo(uniqueSet.End()));
        }
        [Test]
        public void FindFailsKeyIsNull()
        {
            Assert.That(uniqueSet.Find(null), Is.EqualTo(uniqueSet.End()));
        }
        [Test]
        public void FindKeyIsNull()
        {
            uniqueSet.Insert(null);
            UniqueSet<string>.Iterator it = uniqueSet.Find(null);
            Assert.That(it, Is.Not.EqualTo(uniqueSet.End()));
        }
        [Test]
        public void Clear()
        {
            Assert.That(uniqueSet, Is.Not.Empty);
            uniqueSet.Clear();
            Assert.That(uniqueSet, Is.Empty);
        }
        [Test]
        public void Empty()
        {
            Assert.That(uniqueSet.Empty, Is.False);
            uniqueSet = new UniqueSet<string>(Compare.Less<string>());
            Assert.That(uniqueSet.Empty, Is.True);
        }
        [Test]
        public void ReverseIterators()
        {
            Vector<int> data = new Vector<int>(0, 1, 2, 3, 4);

            UniqueSet<int> m = new UniqueSet<int>(Compare.Less<int>(), data);

            Algorithm.Reverse(data.Begin(), data.End());

            ICollection actual = NStlUtil.Collection(m.RBegin(), m.REnd());
            Assert.That(actual, Is.EqualTo(data));
        }
        [Test]
        public void CountOf()
        {
            Assert.That(uniqueSet.CountOf("5"), Is.EqualTo(1));
            Assert.That(uniqueSet.CountOf("1"), Is.EqualTo(1));
            Assert.That(uniqueSet.CountOf("42"), Is.EqualTo(0));
        }
        [Test]
        [ExpectedException(typeof(ArgumentNullException))]
        public void CountOfFailsKeyIsNull()
        {
            uniqueSet.CountOf(null);
        }
        [Test]
        public void Swap()
        {
            Vector<int> v1 = new Vector<int>(0, 1, 2, 3, 4);

            UniqueSet<int> m1 = new UniqueSet<int>(Compare.Less<int>(), v1);

            Vector<int> v2 = new Vector<int>(5, 6, 7, 8);
            UniqueSet<int> m2 = new UniqueSet<int>(Compare.Less<int>(), v2);

            m1.Swap(m2);

            Assert.That(m1, Is.EqualTo(v2));
            Assert.That(m2, Is.EqualTo(v1));
        }
        [Test]
        public void UpperBound()
        {
            UniqueSet<string>.Iterator upperBound = uniqueSet.UpperBound("1");
            Assert.That(upperBound, Is.Not.EqualTo(uniqueSet.End()));
            Assert.That(upperBound.Value, Is.EqualTo("2"));
        }
        [Test]
        public void UpperBoundFails()
        {
            UniqueSet<string>.Iterator upperBound = uniqueSet.UpperBound("7");
            Assert.That(upperBound, Is.EqualTo(uniqueSet.End()));
        }
        [Test]
        public void UpperBoundFailsKeyIsNull()
        {
            UniqueSet<string>.Iterator upperBound = uniqueSet.UpperBound(null);
            Assert.That(upperBound, Is.EqualTo(uniqueSet.Begin()));
        }
        [Test]
        public void LowerBound()
        {
            UniqueSet<string>.Iterator lowerBound = uniqueSet.LowerBound("1");
            Assert.That(lowerBound.Value, Is.EqualTo("1"));
        }
        [Test]
        public void LowerBoundFails()
        {
            UniqueSet<string>.Iterator lowerBound = uniqueSet.LowerBound("7");
            Assert.That(lowerBound, Is.EqualTo(uniqueSet.End()));
        }
        [Test]
        public void LowerBoundKeyIsNull()
        {
            UniqueSet<string>.Iterator lowerBound = uniqueSet.LowerBound(null);
            Assert.That(lowerBound, Is.EqualTo(uniqueSet.Begin()));
        }
        [Test]
        public void EqualRange()
        {
            Range<string, UniqueSet<string>.Iterator> equalRange = uniqueSet.EqualRange("1");

            ICollection expected = new string[] {"1"};

            Assert.That(equalRange, Is.EqualTo(expected));
        }
        [Test]
        public void EqualRangeKeyIsNull()
        {
            Range<string, UniqueSet<string>.Iterator> equalRange = uniqueSet.EqualRange(null);

            ICollection expected = new string[] {  };

            Assert.That(equalRange, Is.EqualTo(expected));
        }
        [Test]
        public void ToArray()
        {
            ICollection clone = uniqueSet.ToArray();
            Assert.That(uniqueSet, Is.EqualTo(clone));
        }
        [Test]
        public void CopyTo()
        {
            string[] clone = new string[uniqueSet.Count];
            uniqueSet.CopyTo(clone, 0);
            Assert.That(uniqueSet, Is.EqualTo(clone));
        }
    }
}
